全文获取类型
收费全文 | 34192篇 |
免费 | 4522篇 |
国内免费 | 3071篇 |
专业分类
电工技术 | 3075篇 |
技术理论 | 7篇 |
综合类 | 4377篇 |
化学工业 | 882篇 |
金属工艺 | 377篇 |
机械仪表 | 1607篇 |
建筑科学 | 8620篇 |
矿业工程 | 477篇 |
能源动力 | 480篇 |
轻工业 | 488篇 |
水利工程 | 337篇 |
石油天然气 | 531篇 |
武器工业 | 362篇 |
无线电 | 3826篇 |
一般工业技术 | 2399篇 |
冶金工业 | 606篇 |
原子能技术 | 209篇 |
自动化技术 | 13125篇 |
出版年
2024年 | 76篇 |
2023年 | 481篇 |
2022年 | 860篇 |
2021年 | 926篇 |
2020年 | 1010篇 |
2019年 | 926篇 |
2018年 | 880篇 |
2017年 | 1146篇 |
2016年 | 1342篇 |
2015年 | 1559篇 |
2014年 | 2498篇 |
2013年 | 2299篇 |
2012年 | 2776篇 |
2011年 | 2931篇 |
2010年 | 2432篇 |
2009年 | 2480篇 |
2008年 | 2560篇 |
2007年 | 2660篇 |
2006年 | 2238篇 |
2005年 | 1811篇 |
2004年 | 1427篇 |
2003年 | 1139篇 |
2002年 | 957篇 |
2001年 | 837篇 |
2000年 | 704篇 |
1999年 | 525篇 |
1998年 | 394篇 |
1997年 | 298篇 |
1996年 | 247篇 |
1995年 | 255篇 |
1994年 | 195篇 |
1993年 | 159篇 |
1992年 | 160篇 |
1991年 | 92篇 |
1990年 | 73篇 |
1989年 | 84篇 |
1988年 | 62篇 |
1987年 | 34篇 |
1986年 | 33篇 |
1985年 | 27篇 |
1984年 | 15篇 |
1983年 | 22篇 |
1982年 | 27篇 |
1981年 | 24篇 |
1980年 | 20篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 9篇 |
1975年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
Greg A. Breed Paul M. Severns Andrew M. Edwards 《Journal of the Royal Society Interface》2015,12(103)
Lévy flights have gained prominence for analysis of animal movement. In a Lévy flight, step-lengths are drawn from a heavy-tailed distribution such as a power law (PL), and a large number of empirical demonstrations have been published. Others, however, have suggested that animal movement is ill fit by PL distributions or contend a state-switching process better explains apparent Lévy flight movement patterns. We used a mix of direct behavioural observations and GPS tracking to understand step-length patterns in females of two related butterflies. We initially found movement in one species (Euphydryas editha taylori) was best fit by a bounded PL, evidence of a Lévy flight, while the other (Euphydryas phaeton) was best fit by an exponential distribution. Subsequent analyses introduced additional candidate models and used behavioural observations to sort steps based on intraspecific interactions (interactions were rare in E. phaeton but common in E. e. taylori). These analyses showed a mixed-exponential is favoured over the bounded PL for E. e. taylori and that when step-lengths were sorted into states based on the influence of harassing conspecific males, both states were best fit by simple exponential distributions. The direct behavioural observations allowed us to infer the underlying behavioural mechanism is a state-switching process driven by intraspecific interactions rather than a Lévy flight. 相似文献
72.
The scheduling process of cracking furnace feedstock is important in an ethylene plant. In this paper it is described as a constraint optimization problem. The constraints consist of the cycle of operation, maximum tube metal temperature, process time of each feedstock, and flow rate. A modified group search optimizer is pro-posed to deal with the optimization problem. Double fitness values are defined for every group. First, the factor of penalty function should be changed adaptively by the ratio of feasible and general solutions. Second, the“excel-lent”infeasible solution should be retained to guide the search. Some benchmark functions are used to evaluate the new algorithm. Final y, the proposed algorithm is used to optimize the scheduling process of cracking furnace feedstock. And the optimizing result is obtained. 相似文献
73.
74.
75.
In this article we illustrate a methodology for building cross-language search engine. A synergistic approach between thesaurus-based approach and corpus-based approach is proposed. First, a bilingual ontology thesaurus is designed with respect to two languages: English and Spanish, where a simple bilingual listing of terms, phrases, concepts, and subconcepts is built. Second, term vector translation is used – a statistical multilingual text retrieval techniques that maps statistical information about term use between languages (Ontology co-learning). These techniques map sets of t f id f term weights from one language to another. We also applied a query translation method to retrieve multilingual documents with an expansion technique for phrasal translation. Finally, we present our findings. 相似文献
76.
Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search. 相似文献
77.
The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data. 相似文献
78.
在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。 相似文献
80.
The multi-index hashing (MIH) is the state-of-the-art method for indexing binary codes. However, it is based on the dataset codes uniform distribution assumption, and will lower efficiency in dealing with non-uniformly distributed codes. In this paper, we propose a data-oriented multi-index hashing method. We first compute the correlations between bits and learn adaptive projection vector for each binary substring. Then, instead of using substrings as direct indices into hash tables, we project them with corresponding projection vectors to generate new indices. With adaptive projection, the indices in each hash table are nearly uniformly distributed. Besides, we put forward an entropy based measurement to evaluate the distribution of data items in each hash table. Experiments conducted on reference large scale datasets show that compared to the MIH the time performance of our method can be 36.9%~87.4% better . 相似文献